Optimal Lewenstein-Sanpera Decomposition for some Biparatite Systems

نویسندگان

  • S. J. Akhtarshenas
  • M. A. Jafarizadeh
چکیده

It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of product set) on the separable-entangled boundary, optimal Lewenstein-Sanpera (L-S) decomposition can be obtained via optimization for a generic entangled density matrix. Based on this, We obtain optimal L-S decomposition for some bipartite systems such as 2⊗2 and 2⊗3 Bell decomposable states, generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one parameter and three parameters local operations and classical communications (LOCC), d ⊗ d Werner and isotropic states, and a one parameter 3 ⊗ 3 state. We also obtain the optimal decomposition for multi partite isotropic state. It is shown that in all 2 ⊗ 2 systems considered here the average concurrence of the decomposition is equal to the concurrence. We also show that for some 2 ⊗ 3 Bell decomposable states the average concurrence of the decomposition is equal to the lower bound of the concurrence of state presented recently in [Buchleitner et al, quant-ph/0302144], so an exact expression for concurrence of these states is obtained. It is also shown that for d ⊗ d isotropic state where decomposition leads to a separable and an entangled pure state, the average I-concurrence of the decomposition is equal to the I-concurrence of the state.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best separable approximation with semi-definite programming method

The present methods for obtaining the optimal LewenesteinSanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using semidefinite programming. Specially, we obtain the optimal Lewenstein-Sanpera decomposition for some examples such as: Bell decomposable state, Iso-concurrence sta...

متن کامل

ar X iv : q ua nt - p h / 02 09 04 5 v 1 5 S ep 2 00 2 Lewenstein - Sanpera Decomposition for 2 ⊗ 2 Systems

As it is well known, every bipartite 2⊗2 density matrix can be obtained from Bell decompos-able states via local quantum operations and classical communications (LQCC). Using this fact, the Lewenstein-Sanpera decomposition of an arbitrary bipartite 2 ⊗ 2 density matrix has been obtained through LQCC action upon Lewenstein-Sanpera decomposition of Bell decomposable states of 2 ⊗ 2 quantum system...

متن کامل

Evaluation of relative entropy of entanglement and derivation of optimal Lewenstein-Sanpera decomposition of Bell decomposable states via convex optimization

We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the KarushKuhn-Tucker optimization method, the minimum relative entropy of entanglement of Bell decomposable states has been evaluated and it is shown that the same separable Bell decomposable state lying at the boundary of convex set of sep...

متن کامل

Remarks on Lewenstein-Sanpera Decomposition

We discuss in this letter Lewenstein-Sanpera (L-S) decomposition for a specific Werner state. Compared with the optimal case, we propose a quasi-optimal one which in the view of concurrence leads to the same entanglement measure for the entangled mixed state discussed. We think that in order to obtain entanglement of given state the optimal L-S decomposition is not necessary. ∗Email: shmj@ustc....

متن کامل

Optimal Unambiguous Discrimination of Quantum States

Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008